Satisfiability modulo theories - PDFSEARCH.IO - Document Search Engine

Satisfiability modulo theories
Results: 199

#	Item
121	PDF Document Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-05-29 03:59:19 Constraint programming Logic in computer science Automated theorem proving Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Uninterpreted function Decision problem Theoretical computer science Mathematics Applied mathematics
122	Planning Modulo Theories: Extending the Planning Paradigm Peter Gregory Derek Long and Maria Fox J. Christopher Beck Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2012-04-19 08:48:52 Automated planning and scheduling Propositional calculus Constraint programming Formal methods Planning Domain Definition Language Boolean algebra Satisfiability Modulo Theories Interpretation Function Logic Mathematics Mathematical logic
123	Bound Propagation for Arithmetic Reasoning in Vampire Ioan Dragan∗ , Konstantin Korovin † , Laura Kov´acs ‡ , Andrei Voronkov † ∗ Vienna University of Technology Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2013-12-12 08:44:35 Operations research Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories Linear programming Local consistency Theoretical computer science Applied mathematics Mathematics
124	LNCS 5123 - <TEX>{CSIsat}</TEX>: Interpolation for LA+EUF Add to Reading List Source URL: www.sosy-lab.org Language: English - Date: 2013-10-11 06:59:10 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Interpolation Satisfiability Modulo Theories Solver Linear programming Theoretical computer science Applied mathematics Mathematics
125	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics
126	Abstract Model Counting: a novel approach for Quantification of Information Leaks Quoc-Sang Phan Pasquale Malacaria Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Formal methods Electronic design automation Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Quicken Interchange Format Java Pathfinder Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
127	Concurrent Bounded Model Checking Quoc-Sang Phan Pasquale Malacaria ˘ areanu Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Formal methods Logic in computer science Electronic design automation NP-complete problems Model checking Java Pathfinder Satisfiability Modulo Theories Concolic testing KeY Theoretical computer science Applied mathematics Mathematics
128	Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ? Alberto Griggio1 , Quoc-Sang Phan2 , Roberto Sebastiani2 and Silvia Tomasi2 Add to Reading List Source URL: disi.unitn.it Language: English - Date: 2011-10-12 05:34:03 Mathematics Logic in computer science NP-complete problems Electronic design automation Formal methods Satisfiability Modulo Theories WalkSAT Resolution Local search Theoretical computer science Constraint programming Applied mathematics
129	Symbolic Execution as DPLL Modulo Theories Quoc-Sang Phan Queen Mary University of London Abstract Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Constraint programming Automated theorem proving Logic in computer science Electronic design automation Formal methods Satisfiability Modulo Theories DPLL algorithm Boolean satisfiability problem Solver Theoretical computer science Applied mathematics Mathematics
130	Verification Condition Generation for Permission Logics with Abstract Predicates and Abstraction Functions Stefan Heule, Ioannis T. Kassios, Peter Müller, and Alexander J. Summers ETH Zurich, Switzerland Add to Reading List Source URL: stefanheule.com Language: English - Date: 2014-09-10 01:53:47 Formal methods Functions and mappings Predicate logic Abstraction Predicate Function Anamorphism Satisfiability Modulo Theories Predicate transformer semantics Mathematics Mathematical logic Logic

UPDATE